The Binary Paint Shop Problem

Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search

Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...

Minimizing Makespan for a Flexible Flow Shop Scheduling Problem in a Paint Company

This paper focuses on a Flexible Flow Shop (FFS) problem in a paint company in an attempt to minimize production makespan. The FFS problem is characterized by multiple products being produced in machines in stages with sequence dependent set up times and infinite intermediate storages. As the FFS problem is computationally complex, two heuristic methods are employed to solve the Mixed Integer L...

MaxFlow-MinCut Duality for a Paint Shop Problem

Complexity Results for Restricted Instances of a Paint Shop Problem

We study the following problem: an instance is a word with every letter occurring twice. A solution is a 2-coloring of the letters in the word such that the two occurrences of every letter are colored with different colors. The goal is to minimize the number of color changes between adjacent letters. This is a special case of the Paint Shop Problem, which was previously shown to be NP-hard. We ...

Car paint thickness control using artificial neural network and regression method

Struggling in world's competitive markets, industries are attempting to upgrade their technologies aiming at improving the quality and minimizing the waste and cutting the price. Industry tries to develop their technology in order to improve quality via proactive quality control. This paper studies the possible paint quality in order to reduce the defects through neural network techniques in au...